Community Detection by Ensemble - Supervised model using Edge, Node and Graph Attributes (E-SEGNA)

نویسنده

  • Julian McAuley
چکیده

Attributes (E-SEGNA) Govardana Sachithanandam Ramachandran Abstract Major social network sites such as Facebook, Twitter & Google+ offer manual classification of friends in the form of List or Circle. With average node degree on these site increasing & with user’s temporal interest evolves the manual classification & re-classification of users become laborious. The project baselines the effectiveness two of more popular existing approaches which uses network structure and nodes attributes to determine number of circles, node membership of these circles and aspects that influences the circle formation. With the baseline number the project analyzes shortcomings of these approaches and tries improvements on the existing approaches. The project is an adaption of problem “Learning Social Circles in Networks” competition in kaggle.com Dataset The dataset used for this project is published @ https://www.kaggle.com/c/learning-social-circles/data . It contains labeled social network data in Facebook, Google+ and Twitter. Properties Values Ego Networks 1,143 Circles 5,541 Users 192,075 Node Attributes 26 [Table:1 The dataset contains]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Overlapping Communities in Social Networks using Deep Learning

In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...

متن کامل

SMACD: Semi-supervised Multi-Aspect Community Detection

Community detection in real-world graphs has been shown to benefit from using multi-aspect information, e.g., in the form of “means of communication” between nodes in the network. An orthogonal line of work, broadly construed as semi-supervised learning, approaches the problem by introducing a small percentage of node assignments to communities and propagates that knowledge throughout the graph...

متن کامل

Clustering attributed graphs: Models, measures and methods

Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that ar...

متن کامل

Graph Hybrid Summarization

One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...

متن کامل

Community Detection with Node Attributes and its Generalization

Community detection algorithms are fundamental tools to understand organizational principles in social networks. With the increasing power of social media platforms, when detecting communities there are two possible sources of information one can use: the structure of social network and node attributes. However structure of social networks and node attributes are often interpreted separately in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014